Skip to content

Conversation

GUMUNYEONG
Copy link
Contributor

  • Valid Anagram
  • Counting Bits
  • Encode and Decode Strings
  • Construct Binary Tree From Preorder And Inorder Traversal
  • Decode Ways

@GUMUNYEONG
Copy link
Contributor Author

복잡도 분석은 코드에 추가하여 다시 올리겠습니다

@GUMUNYEONG GUMUNYEONG marked this pull request as ready for review August 24, 2024 17:00
Copy link
Member

@DaleSeo DaleSeo left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

수고하셨습니다!

Comment on lines 19 to 25
} else {
result = false;
break;
}
}

return result;
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

요렇게 하시면 더 깔끔하고 효율적인 코드가 되지 않을까 생각이 들었습니다 :)

Suggested change
} else {
result = false;
break;
}
}
return result;
} else {
return false;
}
}
return true;

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

앗 더 간단하게 표현할 수 있었네요..! 피드백 감사합니다! :>

@DaleSeo DaleSeo requested a review from HC-kang August 24, 2024 19:14
@GUMUNYEONG GUMUNYEONG merged commit 45ea72e into DaleStudy:main Aug 25, 2024
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
No open projects
Status: Completed
Development

Successfully merging this pull request may close these issues.

2 participants